An efficient algorithm for globally solving generalized linear multiplicative programming
نویسندگان
چکیده
منابع مشابه
An efficient method for generalized linear multiplicative programming problem with multiplicative constraints
We present a practical branch and bound algorithm for globally solving generalized linear multiplicative programming problem with multiplicative constraints. To solve the problem, a relaxation programming problem which is equivalent to a linear programming is proposed by utilizing a new two-phase relaxation technique. In the algorithm, lower and upper bounds are simultaneously obtained by solvi...
متن کاملAn Effective Algorithm for Globally Solving a Class of Linear Fractional Programming Problem
This article presents a branch-and-bound algorithm for globally solving the general linear sum of ratios problem (GFP). By utilizing equivalent transformation and linearization technique, a linear relaxation programming (LRP) of original problem is constructed. The algorithm economizes the required computations by conducting the branch-and-bound search in p R , rather than in n R , where p is t...
متن کاملAn Efficient Numerical Algorithm For Solving Linear Differential Equations of Arbitrary Order And Coefficients
Referring to one of the recent works of the authors, presented in~cite{differentialbpf}, for numerical solution of linear differential equations, an alternative scheme is proposed in this article to considerably improve the accuracy and efficiency. For this purpose, triangular functions as a set of orthogonal functions are used. By using a special representation of the vector forms of triangula...
متن کاملA Branch-and-Reduce Approach for Solving Generalized Linear Multiplicative Programming
We consider a branch-and-reduce approach for solving generalized linear multiplicative programming. First, a new lower approximate linearization method is proposed; then, by using this linearization method, the initial nonconvex problem is reduced to a sequence of linear programming problems. Some techniques at improving the overall performance of this algorithm are presented. The proposed algo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2016
ISSN: 0377-0427
DOI: 10.1016/j.cam.2015.11.009